Computing the Fréchet Distance with a Retractable Leash
نویسندگان
چکیده
All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fréchet distance between polygonal curves in Rd under polyhedral distance functions (e.g., L1 and L∞). We also get a (1+ ε)-approximation of the Fréchet distance under the Euclidean metric, in quadratic time for any fixed ε > 0. For the exact Euclidean case, our framework currently yields an algorithm with running time O(n2 log2 n). However, we conjecture that it may eventually lead to a faster exact algorithm.
منابع مشابه
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
The Fréchet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Fréchet distance to more general metric spaces, which requires the leash itself to move continuously over time. For example, for curves in the punctured plan...
متن کاملHow Difficult is it to Walk the Dog?
We study the complexity of computing the Fréchet distance (also called dog-leash distance) between two polygonal curves with a total number of n vertices. For two polygonal curves in the plane we prove an Ω(n log n) lower bound for the decision problem in the algebraic computation tree model allowing arithmetic operations and tests. Up to now only a O(n) upper bound for the decision problem was...
متن کاملComputing the Fréchet Gap Distance
Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we ...
متن کاملLecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex
Figure 1: Two greatly different curves have a small Hausdroff distance Fréchet distance is a good similarity measurement for curves in Euclidean space. It can be simply described by a daily example. Suppose a dog and its owner are walking along two different paths (curves), connected by a leash. Both of them are moving continuously and forwards only, at any speed or even stop. Then length of th...
متن کاملThe Discrete Fréchet Gap
We introduce the discrete Fréchet gap and its variants as an alternative measure of similarity between polygonal curves. We believe that for some applications the new measure (and its variants) may better reflect our intuitive notion of similarity than the discrete Fréchet distance (and its variants), since the latter measure is indifferent to (matched) pairs of points that are relatively close...
متن کامل